Bi-criteria and approximation algorithms for restricted matchings
نویسندگان
چکیده
منابع مشابه
Bi-criteria and approximation algorithms for restricted matchings
In this work we study approximation algorithms for the Bounded Color Matching problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge e has a color ce and a profit pe ∈ Q, we want to compute a maximum (cardinality or profit) matching in which no more than wj ∈ Z edges of color cj are present. This kind of problems, beside the theoretical intere...
متن کاملApproximation Algorithms for the Bi-criteria Weighted max-cut Problem
We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and the non-existence of feasible cuts that are at the same time near optimal for both criteria. Furthermore, two approximation algorithms with performance guarantee are presented. The first one is deterministic while the second one ...
متن کاملApproximation Algorithms for Bi-clustering Problems
One of the main goals in the analysis of microarray data is to identify groups of genes and groups of experimental conditions (including environments, individuals, and tissues) that exhibit similar expression patterns. This is the so-called biclustering problem. In this paper, we consider two variations of the biclustering problem: the consensus submatrix problem and the bottleneck submatrix pr...
متن کاملApproximation algorithms for restricted Bayesian network structures
Bayesian Network structures with a maximum in-degree of k can be approximated with respect to a positive scoring metric up to an factor of 1/k.
متن کاملFast approximation algorithms for bi-criteria scheduling with machine assignment costs
Article history: Received 28 May 2013 Accepted 17 March 2014 Available online 29 March 2014
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2014
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.11.027